Direct Estimation of Linear Functionals from Indirect Noisy Observations
نویسندگان
چکیده
منابع مشابه
Direct Estimation of Linear Functionals from Indirect Noisy Observations
The authors study the efficiency of the linear–functional strategy, as introduced by Anderssen (1986), for inverse problems with observations blurred by Gaussian white noise with known intensity δ. The optimal accuracy is presented and it is shown how this can be achieved by a linear–functional strategy based on the noisy observations. This optimal linear–functional strategy is obtained from Ti...
متن کاملSparse Estimation From Noisy Observations of an Overdetermined Linear System
This note studies a method for the efficient estimation of a finite number of unknown parameters from linear equations, which are perturbed by Gaussian noise. In case the unknown parameters have only few nonzero entries, the proposed estimator performs more efficiently than a traditional approach. The method consists of three steps: (1) a classical Least Squares Estimate (LSE), (2) the support ...
متن کاملOptimal Change-Point Estimation from Indirect Observations
We study nonparametric change-point estimation from indirect noisy observations. Focusing on the white noise convolution model, we consider two classes of functions that are smooth apart from the change-point. We establish lower bounds on the minimax risk in estimating the change-point and develop rate optimal estimation procedures. The results demonstrate that the best achievable rates of conv...
متن کاملEfficient estimation using both direct and indirect observations
The Ibragimov Hasminskii model postulates observing X1, . . . , Xm independent, identically distributed according to an unknown distribution G and Y1, . . . , Yn independent and identically distributed according to ∫ k(·, y)dG(y) where k is known, for example, Y is obtained from X by convolution with a Gaussian density. We exhibit sieve type estimates of G which are efficient under minimal cond...
متن کاملEstimation from Indirect Supervision with Linear Moments
In structured prediction problems where we have indirect supervision of the output, maximum marginal likelihood faces two computational obstacles: non-convexity of the objective and intractability of even a single gradient computation. In this paper, we bypass both obstacles for a class of what we call linear indirectly-supervised problems. Our approach is simple: we solve a linear system to es...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2002
ISSN: 0885-064X
DOI: 10.1006/jcom.2001.0614